Broadcast Control with Constant-distance Random Movement
نویسندگان
چکیده
منابع مشابه
Control of movement distance in Parkinson's disease.
Studies of electromyographic (EMG) patterns during movements in Parkinson's disease (PD) have often yielded contradictory results, making it impossible to derive a set of rules to explain how muscles are activated to perform different movement tasks. We sought to clarify the changes in modulation of EMG parameters associated with control of movement distance during fast movements in patients wi...
متن کاملBroadcast Authentication With Hashed Random Preloaded Subsets
We introduce a novel cryptographic paradigm of broadcast authentication with “preferred” verifiers (BAP). With BAP, the message source explicitly targets a set of one or more verifiers. For an attacker, forging authentication data of a source, for purposes of fooling preferred verifiers may be substantially more difficult than fooling other (non-preferred) verifiers. We investigate broadcast au...
متن کاملAdaptively Secure Recipient Revocable Broadcast Encryption with Constant size Ciphertext
In this paper, we put forward the first adaptively secure recipient revocable broadcast encryption (RR-BE) scheme in the standard model. The scheme is adaptively secure against chosen plaintext attack (CPA) under the q-weaker Decisional Augmented Bilinear Diffie-Hellman Exponent (qwDABDHE) assumption. Our scheme compares well with the only existing RR-BE scheme of Susilo et al. which is selecti...
متن کاملImproved Broadcast Encryption Scheme with Constant-Size Ciphertext
The Boneh-Gentry-Waters (BGW) [4] scheme is one of the most efficient broadcast encryption scheme regarding the overhead size. This performance relies on the use of a pairing. Hence this protocol can benefit from public key improvements. The ciphertext is of constant size, whatever the proportion of revoked users is. The main lasting constraint is the computation time at receiver end as it depe...
متن کاملSimulating a Random Walk with Constant Error
We analyze Jim Propp’s P -machine, a simple deterministic process that simulates a random walk on Zd to within a constant. The proof of the error bound relies on several estimates in the theory of simple random walks and some careful summing. We mention three intriguing conjectures concerning signchanges and unimodality of functions in the linear span of {p(·,x) : x ∈ Zd}, where p(n,x) is the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2014
ISSN: 0453-4654,1883-8189
DOI: 10.9746/sicetr.50.139